Least-Cost Opportunistic Routing
نویسندگان
چکیده
In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the packet further. If no candidate receives the packet, then the current sender re-transmits. If multiple candidates receive the packet, then the link layer chooses a single receiver to be the relay. This choice could be made at random, or it could be driven by information coming from the routing layer, for example to use the best receiver as the relay. This paper addresses the least-cost opportunistic routing (LCOR) problem: how to assign and prioritize the set of candidate relays at each node for a given destination such that the expected cost of forwarding a packet to the destination is minimized. We solve this problem with a distributed algorithm that provably computes the optimal assignment of candidate relays that each node should allow to reach a particular destination. Prior proposals based on single-path routing metrics or geographic coordinates do not explicitly consider this tradeoff, and as a result make choices which are not always optimal.
منابع مشابه
Improving Performance of Opportunistic Routing Protocol using Fuzzy Logic for Vehicular Ad-hoc Networks in Highways
Vehicular ad hoc networks are an emerging technology with an extensive capability in various applications including vehicles safety, traffic management and intelligent transportation systems. Considering the high mobility of vehicles and their inhomogeneous distributions, designing an efficient routing protocol seems necessary. Given the fact that a road is crowded at some sections and is not c...
متن کاملDelay Constraint Adaptive Routing Based on Seed Spray in Opportunistic Networks ?
Opportunistic networks are sparse wireless networks which have no complete path from the source to the destination most of the time. Many applications require the support of delay constrained routing mechanism which can provide acceptable and resilient services in the challenged environments. We proposed Adaptive Seed Spray (ASS) to achieve the delay constraint with low cost in dynamic opportun...
متن کاملA Preemptive Link State Spanning Tree Source Routing Scheme for Opportunistic Data Forwarding in MANET
Opportunistic Data Forwarding (ODF) has drawn much attention in mobile adhoc networking research in recent years. The effectiveness of ODF in MANET depends on a suitable routing protocol which provides a powerful source routing services. PLSR is featured by source routing, loop free and small routing overhead. The update messages in PLSR are integrated into a tree structure and no need to time ...
متن کاملAn Energy-Efficient Opportunistic Routing for Load-Balancing in Wireless Sensors Networks
Opportunistic routing has been widely approved because of its throughput improvement for wireless mesh networks; however, few researches focus on transforming its benefit into realizing energy efficiency for wireless sensor networks (WSNs). We notice that two common issues in fixed-path routing schemes, including single-path routing or multi-path routing, are that (1) a path may traverse throug...
متن کاملEvaluation of Opportunistic Routing Algorithms on Opportunistic Mobile Sensor Networks with Infrastructure Assistance
Recently the increasing number of sensors integrated in smartphones, especially the iPhone and Android phones, has motivated the development of routing algorithms for Opportunistic Mobile Sensor Networks (OppMSNs). Although there are many existing opportunistic routing algorithms, researchers still have an ambiguous understanding of how these schemes perform on OppMSNs with heterogeneous archit...
متن کامل